genetic algorithm based on explicit memory for solving dynamic problems
نویسندگان
چکیده
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memory in the field, which involves key design issues concerning the memory content, the process of memory update, and the process of memory retrieval. with use of the aging best solution and keeping diversity in population, the speed convergence of algorithm can be increased. this article presents a genetic algorithm based on memory for dealing with dynamic optimization problems and focuses on explicit placement of memory schemes, and performs a comprehensive analysis on current design of moving peaks benchmark (mpb) problem. the mpb problem is the most proper benchmark for simulation of dynamic environments. the experimental study show the efficiency of the proposed approach for solving dynamic optimization problems in comparison with other algorithms presented in the literature.
منابع مشابه
Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملProviding an algorithm for solving general optimization problems based on Domino theory
Optimization is a very important process in engineering. Engineers can create better production only if they make use of optimization tools in reduction of its costs including consumption time. Many of the engineering real-word problems are of course non-solvable mathematically (by mathematical programming solvers). Therefore, meta-heuristic optimization algorithms are needed to solve these pro...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Modified Cultural Algorithm based on Genetic Algorithm for Solving Global Optimization Problems
This paper introduce one innovations into the world of multimodal function optimization: a new Cultural Algorithm (CA) based on Genetic Algorithm (GA) with a new adaptive mutation (AM-CGA). The idea is to use knowledge about local optima found during the search with other techniques utilized for escape from local minimum in multimodal functions. The search knowledge was maintained using a Cultu...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of advances in computer researchجلد ۷، شماره ۲، صفحات ۵۳-۶۸
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023